A componentwise index of service measurement in multi‐component systems

In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

截顶圆锥薄壳振动特性的计算

用有限单元法计算,单元为轴对称截锥壳。法向位移函数w 和周向位移函数v 采用三次多项式,纵向位移函数u 为线性多项式。其节圆自由度选取节圆上三个位移,一个转角和一个剪应变。计算结果与文献[1]、[2]和[3]作了比较。这方法和程序可以应用于计算截顶圆锥壳的振动特性。     

确立与建设信息化部队相适应的思想观念

积极推进中国特色军事变革 ,领导干部必须牢固确立与建设信息化部队相适应的思想观念 :其一 ,信息化战争正逐步取代机械化战争 ;推进中国特色军事变革 ,必须确立信息化是我军现代化建设“主要目标”的观念。其二 ,信息化战争中信息居于整个作战体系的中枢 ;建设信息化部队 ,必须确立信息力是“第一战斗力”的观念。其三 ,信息化战争实质上是人的知识技能的较量 ;建设信息化部队 ,必须确立人才是“第一资源”的观念。其四 ,信息化战争是诸军兵种一体化的联合作战 ;建设信息化部队 ,必须确立搞好顶层设计、促进全面协调发展是“第一要求”的观念     

The continuous‐time single‐sourcing problem with capacity expansion opportunities

This paper develops a new model for allocating demand from retailers (or customers) to a set of production/storage facilities. A producer manufactures a product in multiple production facilities, and faces demand from a set of retailers. The objective is to decide which of the production facilities should satisfy each retailer's demand, in order minimize total production, inventory holding, and assignment costs (where the latter may include, for instance, variable production costs and transportation costs). Demand occurs continuously in time at a deterministic rate at each retailer, while each production facility faces fixed‐charge production costs and linear holding costs. We first consider an uncapacitated model, which we generalize to allow for production or storage capacities. We then explore situations with capacity expansion opportunities. Our solution approach employs a column generation procedure, as well as greedy and local improvement heuristic approaches. A broad class of randomly generated test problems demonstrates that these heuristics find high quality solutions for this large‐scale cross‐facility planning problem using a modest amount of computation time. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Analysis and optimal design of discrete order picking technologies along a line

Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dominating sets for rectilinear center location problems with polyhedral barriers

In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

IOCP模型及在僵尸网络通信模块中的应用

I/O 完成端口(IOCP)是伸缩性最好的一种 I/O 模型。论文介绍了 IOCP 完成端口的基本概念和IOCP 模型的工作机制,在僵尸网络的背景下,讨论了基于 IOCP 通信模块的设计和进一步挖掘系统性能的方法,最后在局域网环境下做了实验仿真。